Functions as processes: termination and the λ̄μμ̃-calculus

نویسندگان

  • Matteo Cimini
  • Claudio Sacerdoti
  • Davide Sangiorgi
چکیده

The λ̄μμ̃-calculus is a variant of the λ-calculus with significant differences, including non-confluence and a Curry-Howard isomorphism with the classical sequent calculus. We present an encoding of the λ̄μμ̃-calculus into the π-calculus. We establish the operational correctness of the encoding, and then we extract from it an abstract machine for the λ̄μμ̃-calculus. We prove that there is a tight relationship between such a machine and Curien and Herbelin’s abstract machine for the λ̄μμ̃-calculus. The π-calculus image of the (typed) λ̄μμ̃-calculus is a nontrivial set of terminating processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intersection and Union Type Assignment and Polarised λ̄μμ̃

Intersection and union type assignment systems are powerful tools for reasoning programs that completely characterise many semantic properties such as strong normalisation. At the same time, they are known to be subtle, particularly in the presence of computational effect. To address the difficulty, this paper develops an approach based on polarities and refinement intersection type systems. We...

متن کامل

Explanation in Natural Language of λ̄μμ̃-terms

The λ̄μμ̃-calculus, introduced by Curien and Herbelin, is a calculus isomorphic to (a variant of) the classical sequent calculus LK of Gentzen. As a proof format it has very remarkable properties that we plan to study in future works. In this paper we embed it with a rendering semantics that provides explanations in pseudo-natural language of its proof terms, in the spirit of the work of Yann Cos...

متن کامل

A Logically Saturated Extension of λ̄μμ̃

This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on λ̄μμ̃, a calculus introduced by Curien and Herbelin [5,6]. Just as λ̄μμ̃ preserves several proof structures that are identified by the λ-calculus, the proof language presented here aims to preserve as much proof structure as reasonable; we call that property being logically saturated. Th...

متن کامل

Certain subclass of $p$-valent meromorphic Bazilevi'{c} functions defined by fractional $q$-calculus operators

The aim of the present paper is to introduce and investigate a new subclass of Bazilevi'{c} functions in the punctured unit disk $mathcal{U}^*$ which have been described through using of the well-known fractional $q$-calculus operators, Hadamard product and a linear operator. In addition, we obtain some sufficient conditions for the func...

متن کامل

lambda-µ-Calculus and Duality: Call-by-Name and Call-by-Value

Under the extension of Curry-Howard’s correspondence to classical logic, Gentzen’s NK and LK systems can be seen as syntaxdirected systems of simple types respectively for Parigot’s λμ-calculus and Curien-Herbelin’s λ̄μμ̃-calculus. We aim at showing their computational equivalence. We define translations between these calculi. We prove simulation theorems for an undirected evaluation as well as f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010